A Random Adaptation Perspective on Distributed Averaging
نویسندگان
چکیده
We propose a random adaptation variant of time-varying distributed averaging dynamics in discrete time. show that this leads to novel interpretations fundamental concepts averaging, opinion dynamics, and learning. Namely, we the ergodicity stochastic chain is equivalent almost sure ( xmlns:xlink="http://www.w3.org/1999/xlink">a.s.) finite-time agreement attainment proposed dynamics. Using result, provide new interpretation for xmlns:xlink="http://www.w3.org/1999/xlink">absolute probability sequence an ergodic chain. then modify base-case into time-reversed inhomogeneous Markov chain, case uniqueness limiting distributions Finally, introduce study version Friedkin-Johnsen model rank-one perturbation
منابع مشابه
Distributed Averaging With Random Network Graphs and Noises
We consider discrete-time distributed averaging algorithms over multi-agent networks with measurement noises and time-varying random graph flows. Each agent updates its state by relative states between neighbours with both additive and multiplicative measurement noises. The network structure is modeled by time-varying random digraphs, which may be spatially and temporally dependent. By developi...
متن کاملRandom Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
In this paper, we address the problem of distributed learning over a decentralized network, arising from scenarios including distributed sensors or geographically separated data centers. We propose a fully distributed algorithm called random walk distributed dual averaging (RW-DDA) that only requires local updates. Our RW-DDA method, improves the existing distributed dual averaging (DDA) method...
متن کاملRandom Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
In this paper, we address the problem of distributed learning over a large number of distributed sensors or geographically separated data centers, which suffer from sampling biases across nodes. We propose an algorithm called random walk distributed dual averaging (RW-DDA) method that only requires local updates and is fully distributed. Our RW-DDA method is robust to the change in network topo...
متن کاملDistributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do not require the agents to have any knowledge about the global network structure or size. Almost sure convergence to state agreement is proved, and the communication and computational complexities of the algorithms are...
متن کاملAveraging along Uniform Random Integers
Motivated by giving a meaning to “The probability that a random integer has initial digit d”, we define a URI-set as a random set E of natural integers such that each n ≥ 1 belongs to E with probability 1/n, independently of other integers. This enables us to introduce two notions of densities on natural numbers: The URI-density, obtained by averaging along the elements of E, and the local URI-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2023
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2022.3187749